Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer
نویسندگان
چکیده
منابع مشابه
Parallel Algorithms for Gray-Scale Digitized Picture Component Labeling on a Mesh-Connected Computer
We consider the problem of labeling connected components in a gray-scale image so that every component is connected, the maximum difference in the gray-scale values of the pixels within any component does not exceed a given value, and no component can be merged with a neighboring component. We develop two asymptotically optimal 0(n) time algorithms for generating such labelings on a mesh-connec...
متن کاملQuadtree Algorithm and Its Application for Image Geometric Properties on a Mesh Connected Computer ( MCG )
Jelloul Elmesbahi, Omar Bouattane, and Zouhair Benabbou t; Sk[f(Z’, 2 ) + W(.’) at;] = F ( d , z’) Sk[f(Z’, z ’ ) + w(z ’ ) at:] < F ( 2 , z k ) sk[f(xk, 2) + w ( x k ) at:] Abstract-Quadtree and octree decomposition of multicolored images is often used to solve problems of image processing. This paper describes a O(1) time algorithm for the decomposition of the images into quadtree and octree ...
متن کاملHypercube Algorithms on Mesh Connected Multicomputers
A new methodology named CALMANT (CC-cube Algorithms on Meshes and Tori) for mapping a kind of algorithms that we call CC-cube algorithm onto multicomputers with hypercube, mesh, or torus interconnection topology is proposed. This methodology is suitable when the initial problem can be expressed as a set of processes that communicate through a hypercube topology (a CC-cube algorithm). There are ...
متن کاملConnected components algorithms for mesh-connected parallel computers
We present a new CREW PRAM algorithm for nding connected components. For a graphG with n vertices andm edges, algorithmA0 requires at mostO(logn) parallel steps and performsO((n+m) logn) work in the worst case. The advantage our algorithm has over others in the literature is that it can be adapted to a 2-D mesh-connected communication model in which all CREW operations are replaced byO(logn) pa...
متن کاملMapping of a Virtual Computer Structure on Mesh-Connected Computers
A virtual computer structure is a common concept in parallel programming languages for making programs simple and portable. It is essential for the implementation of distributed data structures and for the generation of SIMD programs through automatic program parallelization. This paper presents a criterion for mappings of virtual computer structures on the target computer. It focuses on Cartes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 1985
ISSN: 0162-8828,2160-9292
DOI: 10.1109/tpami.1985.4767645